Extending the Regular Restriction of Resolution to Non-Linear Subdeductions

نویسندگان

  • Bruce Spencer
  • Joseph Douglas Horton
چکیده

A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which detects whether reordering the resolutions in a given proof will generate an irregular proof. If so, the given proof is not minimal. A deduction system that keeps only minimal proofs retains completeness. We report on an initial implementation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the Regular Restriction of Resolution to Non- Subdeductions

A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which detects whether reordering the resolutions in a given proof will generate an irregular proof. If so, the given proof is not minimal. A deduction system that keeps only minimal proofs retains completen...

متن کامل

Generalized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs

Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...

متن کامل

A Comparison of Mechanisms for Avoiding Repetition of Subdeductions in Chain Formal Linear Deduction Systems

One problem that chain format linear deduction systems can suffer from is the necessity of repeating subdeductions when unifiable literals appear in (possibly distinct) centre chains of a deduction. Four mechanisms for avoiding the repetition are : factoring, lemmas, C-literals, and caching. These mechanisms are examined, and it is concluded that lemmas and C-literals are the mechanisms of choi...

متن کامل

Linear-Input Subset Analysis

There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are performed. Three methods of detecting these situations are described in this paper. The first method (Horn subset analysis) focuses on Horn input chains while the second (LISS analysis) and third (LISL analysis) are s...

متن کامل

Non-linear Analysis of Stability in the Islamic Banking Industry

Stability analysis is one of the most important fields of study in the Islamic banking and finance industry. For measuring stability in Islamic banking, we introduced, for the first time, an Islamic banking stability index (IBS) during 2013 to 2016 which use all CAMEL factors and so seems to be more comprehensive than Z-score stability index which dominantly used in the existing literatures. To...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997